Determinacy - (Observation Equivalence = Trace Equivalence)

نویسنده

  • Joost Engelfriet
چکیده

If an experiment s is conducted on a parallel process p, then, in general, different processes may result from the experiment, due to the nondeterministic behaviour of p (in the notation of Milner (1980): p ~ p' for different p'). Process p is called determinate if the resulting processes are all equivalent (i.e., if p A=> p' and p ~ p", then p' and p" are equivalent). This means that, although p behaves nondeterministically, this cannot be detected by an observer of p. Let -denote observation equivalence, used in CCS (Milner, 1980), let f denote (the much weaker) failure equivalence, used for CSP (Hoare et al., 1981 ; Brookes, 1983), and let t denote (the still weaker) trace equivalence. We show that the three corresponding notions of determinacy are the same, and that for determinate processes -~, f , and t are the same. Determinacy is preserved under and ~--f, but not under t -

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalences in Bicategories

In this paper, we establish some connections between the concept of an equivalence of categories and that of an equivalence in a bicategory. Its main result builds upon the observation that two closely related concepts, which could both play the role of an equivalence in a bicategory, turn out not to coincide. Two counterexamples are provided for that goal, and detailed proofs are given. In par...

متن کامل

Partial Observation in Distributed Supervisory Control of Discrete-Event Systems

Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...

متن کامل

Determinacy and Π 11 transfinite recursion along ω

It is known that almost all important set existence axioms in second order arithmetic can be characterized by determinacy schemes of infinite games. In this article, we sketch the proof of the equivalence between Π1 transfinite recursion along ω and determinacy scheme.

متن کامل

Analytic Equivalence Relations Satisfying Hyperarithmetic-is-recursive

We prove, in ZF+Σ2-determinacy, that for any analytic equivalence relation E, the following three statements are equivalent: (1) E does not have perfectly many classes, (2) E satisfies hyperarithmetic-is-recursive on a cone, and (3) relative to some oracle, for every equivalence class [Y ]E we have that a real X computes a member of the equivalence class if and only if ω 1 ≥ ω [Y ] 1 . We also ...

متن کامل

Notions of State Equivalence under Partial Observability

We explore equivalence relations between states in Markov Decision Processes and Partially Observable Markov Decision Processes. We focus on two different equivalence notions: bisimulation (Givan et al, 2003) and a notion of trace equivalence, under which states are considered equivalent roughly if they generate the same conditional probability distributions over observation sequences (where th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 1985